Response Time Minimization Task Scheduling Algorithm
نویسندگان
چکیده
منابع مشابه
Optimization Task Scheduling Algorithm in Cloud Computing
Since software systems play an important role in applications more than ever, the security has become one of the most important indicators of softwares.Cloud computing refers to services that run in a distributed network and are accessible through common internet protocols. Presenting a proper scheduling method can lead to efficiency of resources by decreasing response time and costs. This rese...
متن کاملoptimization task scheduling algorithm in cloud computing
since software systems play an important role in applications more than ever, the security has become one of the most important indicators of softwares.cloud computing refers to services that run in a distributed network and are accessible through common internet protocols. presenting a proper scheduling method can lead to efficiency of resources by decreasing response time and costs. this rese...
متن کاملTASA: A New Task Scheduling Algorithm in Cloud Computing
Cloud computing refers to services that run in a distributed network and are accessible through common internet protocols. It merges a lot of physical resources and offers them to users as services according to service level agreement. Therefore, resource management alongside with task scheduling has direct influence on cloud networks’ performance and efficiency. Presenting a proper scheduling ...
متن کاملA Power-Aware, Best-Effort Real-Time Task Scheduling Algorithm
In this paper, we present a power-aware, besteffort real-time task scheduling algorithm called PA-BTA that optimizes real-time performance and power consumption. The algorithm considers a timeliness model where task timing constraints are described using Jensen’s benefit functions and a system-level power model. We propose a metric called “Energy and Real-Time Performance Grade” (ERG) to measur...
متن کاملRun-Time Task Scheduling
Task scheduling is one of the main challenges in every system design, and especially in embedded systems design. Task scheduling might be classified in two broad categories: (1) compile time (static scheduling) or (2) run time (dynamic scheduling). Recently there has been a growing interest in the development of run-time scheduling techniques for platform-based designs [1][2]. This interest is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2016
ISSN: 0975-8887
DOI: 10.5120/ijca2016910532